Locality Sensitive K-means Clustering
نویسندگان
چکیده
منابع مشابه
Locality Sensitive Clustering in High Dimensional Space
In high dimension space, many conventional clustering algorithms do not work well in effectiveness and efficiency, especially for image data set. For example, k-means is widely used in image clustering especially visual clustering. But its drawback such as long clustering time and high memory cost seriously deteriorates feasibility in incremental large image set. To improve the feasibility, we ...
متن کاملKernelized Locality-Sensitive Hashing for Semi-Supervised Agglomerative Clustering
Large scale agglomerative clustering is hindered by computational burdens. We propose a novel scheme where exact inter-instance distance calculation is replaced by the Hamming distance between Kernelized Locality-Sensitive Hashing (KLSH) hashed values. This results in a method that drastically decreases computation time. Additionally, we take advantage of certain labeled data points via distanc...
متن کاملAdaptive Mean Shift Based Clustering in High Dimensions
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are constrained to be spherically symmetric and their number has to be known a priori. In nonparametric clustering methods, like the one based on mean shift, these limitations are eliminated but the amount of computation bec...
متن کاملA Content-based Music Similarity Retrieval Scheme by Using BoW Representation and LSH-based Retrieval
This extended abstract paper presents detailed information about a content-based music similarity retrieval scheme, which is based on locality sensitive hashing (LSH). Our scheme considered MFCC and time histogram (TH) as two major features to represent the properties of audio music similarity. Next, each feature is depicted by Bag of Words (BoW), which k-means clustering summarizes extracted f...
متن کاملRandomize color signature employing locality-sensitive hashing (LSH)
Visual signatures construction of images is an essential step for the CBIR system. When the database size become larger. Most existing algorithms (e.g. k-means, Kd-tree, Mean-shift) to build signature become unfavorable due to the prohibitive time and space requirements. In this paper we propose the randomize color signature based on the LSH technique. The proposed descriptor benefited of the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 34 شماره
صفحات -
تاریخ انتشار 2018